Self-adaptive Extrapolated Gauss-Seidel Iterative Methods
نویسندگان
چکیده
In this paper, we consider a self-adaptive extrapolated Gauss-Seidel method for solving the Hermitian positive definite linear systems. Based on optimization models, self-adaptive optimal factor is given. Moreover, we prove the convergence of the self-adaptive extrapolated Gauss-Seidel method without any constraints on optimal factor. Finally, the numerical examples show that the self-adaptive extrapolatedGaussSeidel method is effective and practical in iteration number. AMS subject classifications: 65F10, 65F50, 15A06
منابع مشابه
An Extrapolated Gauss - Seidel Iteration for Hessenberg Matrices
We show that for certain systems of linear equations with coefficient matrices of Hessenberg form it is possible to use Gaussian elimination to obtain an extrapolated version of the Gauss-Seidel iterative process where the iteration matrix has spectral radius zero. Computational aspects of the procedure are discussed.
متن کاملSolving Linear Equations by Classical Jacobi-SR Based Hybrid Evolutionary Algorithm with Uniform Adaptation Technique
Solving a set of simultaneous linear equations is probably the most important topic in numerical methods. For solving linear equations, iterative methods are preferred over the direct methods specially when the coefficient matrix is sparse. The rate of convergence of iteration method is increased by using Successive Relaxation (SR) technique. But SR technique is very much sensitive to relaxatio...
متن کاملComparison results on the preconditioned mixed-type splitting iterative method for M-matrix linear systems
Consider the linear system Ax=b where the coefficient matrix A is an M-matrix. In the present work, it is proved that the rate of convergence of the Gauss-Seidel method is faster than the mixed-type splitting and AOR (SOR) iterative methods for solving M-matrix linear systems. Furthermore, we improve the rate of convergence of the mixed-type splitting iterative method by applying a preconditio...
متن کاملPreconditioned Gauss-seidel Iterative Method for Z-matrices Linear Systems
For Ax = b, it has recently been reported that the convergence of the preconditioned Gauss-Seidel iterative method which uses a matrix of the type P = I + S (α) to perform certain elementary row operations on is faster than the basic Gauss-Seidel method. In this paper, we discuss the adaptive Gauss-Seidel iterative method which uses P = I + S (α) + K̄ (β) as a preconditioner. We present some com...
متن کاملGauss-Seidel Iterative Methods for Rank Deficient Least Squares Problems
We study the semiconvergence of Gauss-Seidel iterative methods for the least squares solution of minimal norm of rank deficient linear systems of equations. Necessary and sufficient conditions for the semiconvergence of the Gauss-Seidel iterative method are given. We also show that if the linear system of equations is consistent, then the proposed methods with a zero vector as an initial guess ...
متن کامل